Mutation Scheduling : A Uni ed Approach toCompiling for Fine - Grain Parallelism ?

Trade-oos between code selection, register allocation, and instruction scheduling are inherently interdependent, especially when compiling for ne-grain parallel architectures. However, the conventional approach to compiling for such machines arbitrarily separates these phases so that decisions made during any one phase place unnecessary constraints on the remaining phases. Mutation Scheduling attempts to solve this problem by combining code selection , register allocation, and instruction scheduling into a uniied framework in which trade-oos between the functional, register, and memory bandwidth resources of the target architecture are made \on the y" in response to changing resource constraints and availability.